Bobtail: A Proof-of-Work Target that Minimizes Blockchain Mining Variance (Draft)

نویسندگان

  • George Bissias
  • Brian Neil Levine
چکیده

Blockchain systems are designed to produce blocks at a constant average rate. The most popular systems currently employ a Proof of Work (PoW) algorithm as a means of creating these blocks. Bitcoin produces, on average, one block every 10minutes. An unfortunate limitation of all deployed PoW blockchain systems is that the time between blocks has high variance. For example, 5% of the time, Bitcoin’s inter-block time is at least 40 minutes. This variance impedes the consistent flow of validated transactions through the system. We propose an alternative process for PoW-based block discovery that results in an interblock time with significantly lower variance. Our algorithm, called Bobtail, generalizes the current algorithm by comparing the mean of the k lowest order statistics to a target. We show that the variance of inter-block times decreases as k increases. If our approach were applied to Bitcoin, about 80% of blocks would be found within 7 to 12 minutes, and nearly every block would be found within 5 to 18 minutes; the average inter-block time would remain at 10 minutes. The cost of our approach is a larger block header.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Game for Mining Pool Selection in Blockchain Networks

In blockchain networks adopting the proof-of-work schemes, the monetary incentive is introduced by the Nakamoto consensus protocol to guide the behaviors of the full nodes (i.e., block miners) in the process of maintaining the consensus about the blockchain state. The block miners have to devote their computation power measured in hash rate in a crypto-puzzle solving competition to win the rewa...

متن کامل

Blockchain-Free Cryptocurrencies. A Rational Framework for Truly Decentralised Fast Transactions

We present a radical solution to the two foremost challenges facing “blockchain”-based cryptocurrencies: (1) “mining pool” oligopolies and (2) incompressibility of delays affecting validation. Both problems stem from the Blockchain mechanism itself, which drives participants into a winner-takes-all global contest that amounts to a low-odds high-variance rewards lottery. Our proposal strips out ...

متن کامل

On the Strategy and Behavior of Bitcoin Mining with N-attackers

Selfish mining is a well-known mining attack strategy discovered by Eyal and Sirer in 2014. After that, the attackers’ strategy space has been extended by many works. These works only analyze the strategy and behavior of one single attacker. The extension of the strategy space is based on the assumption that there is only one attacker in the blockchain network. However, a proof of work blockcha...

متن کامل

Image-based Proof of Work Algorithm for the Incentivization of Blockchain Archival of Interesting Images

A new variation of blockchain proof of work algorithm is proposed to incentivize the timely execution of image processing algorithms. A sample image processing algorithm is proposed to determine “interesting” images using analysis of the entropy of pixel subsets within images. The efficacy of the image processing algorithm is examined using two small sets of training and test data. The interest...

متن کامل

TwinsCoin: A Cryptocurrency via Proof-of-Work and Proof-of-Stake

We design and implement TwinsCoin, the €rst cryptocurrency based on a provably secure and scalable public blockchain design using both proof-of-work and proof-of-stake mechanisms. Di‚erent from the proof-ofwork based Bitcoin, our construction uses two types of resources, computing power and coins (i.e., stake). Œe blockchain in our system is more robust than that in a pure proof-of-work based s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1709.08750  شماره 

صفحات  -

تاریخ انتشار 2017